Coordinated design of TCSC and PSS controllers using VURPSO and Genetic algorithms for multi-machine power system stability

Thyristor controlled series capacitor (TCSC) can regulate line impedance and therefore increase transferred power of the system. On the other hand power system stabilizer (PSS) increases dynamic stability of generator. To enhance the stability, combination of TCSC and PSS can be applied, and in such a case coordination of TCSC and PSS is essential. This paper applies this combined controller in order to enhance the stability of multi-machine system. Parameters of these controllers are optimized by velocity update relaxation particle swarm optimization (VURPSO) algorithm and Genetic algorithm (GA). The simulation results show that the combination of VURPSO algorithm and GA leads to a better design and stability.     

Fast implementation of dense stereo vision algorithms on a highly parallel SIMD architecture

In this paper, we present faster than real-time implementation of a class of dense stereo vision algorithms on a low-power massively parallel SIMD architecture, the CSX700. With two cores, each with 96 Processing Elements, this SIMD architecture provides a peak computation power of 96 GFLOPS while consuming only 9 Watts, making it an excellent candidate for embedded computing applications. Exploiting full features of this architecture, we have developed schemes for an efficient parallel implementation with minimum of overhead. For the sum of squared differences (SSD) algorithm and for VGA (640 × 480) images with disparity ranges of 16 and 32, we achieve a performance of 179 and 94 frames per second (fps), respectively. For the HDTV (1,280 × 720) images with disparity ranges of 16 and 32, we achieve a performance of 67 and 35 fps, respectively. We have also implemented more accurate, and hence more computationally expensive variants of the SSD, and for most cases, particularly for VGA images, we have achieved faster than real-time performance. Our results clearly demonstrate that, by developing careful parallelization schemes, the CSX architecture can provide excellent performance and flexibility for various embedded vision applications.     

A Model for Locating Park-and-Ride Facilities on Urban Networks Based on Maximizing Flow Capture: A Case Study of Isfahan, Iran

Traffic congestion is one of the main problems in large cities for which several approaches have been proposed. Park-and-ride is one of the best approaches that can remove traffic from the traffic network. Park-and-ride facilities are an important part of urban mass transit systems, effectively extending the service area and attracting commuters and other people who may not otherwise have used mass transit. However, its efficiency depends on its location in the urban network. In this research, we focus on travel time of shortest paths instead of the distance criterion for computing network traffic and develop a model for finding the best location(s) for siting park-and-ride systems so as to minimize the network traffic. The model is formulated based on population points, potential sites for park-and-ride establishment, and several Central Business District (CBDs). Then we present a Genetic algorithm that has been proved to be efficient in solving large size problems. Finally, the proposed model is used to locate park-and-ride facilities in the city of Isfahan, Iran.     

Controller Synthesis with Highly Simplified Linear Constraints

This paper deals with the problem of forbidden states in safe Petri nets to obtain a maximally permissive controller. To prevent the system from entering the forbidden states, assigning some constraints to them is possible. The constraints can be enforced on the system using control places. When the number of forbidden states is large, a large number of constraints should be assigned to them. This results in a large number of control places being added to the model of the system, which causes a complicated model. Some methods have been proposed to reduce the number of constraints. Nevertheless, they do not always give the best results. In this paper, two ideas are offered to reduce the number of constraints, giving a more simplified controller.     

“How do you know that I don’t understand?” A look at the future of intelligent tutoring systems

Many software systems would significantly improve performance if they could adapt to the emotional state of the user, for example if Intelligent Tutoring Systems (ITSs), ATM’s, ticketing machines could recognise when users were confused, frustrated or angry they could guide the user back to remedial help systems so improving the service. Many researchers now feel strongly that ITSs would be significantly enhanced if computers could adapt to the emotions of students. This idea has spawned the developing field of affective tutoring systems (ATSs): ATSs are ITSs that are able to adapt to the affective state of students. The term “affective tutoring system” can be traced back as far as Rosalind Picard’s book Affective Computing in 1997.This paper presents research leading to the development of Easy with Eve, an ATS for primary school mathematics. The system utilises a network of computer systems, mainly embedded devices to detect student emotion and other significant bio-signals. It will then adapt to students and displays emotion via a lifelike agent called Eve. Eve’s tutoring adaptations are guided by a case-based method for adapting to student states; this method uses data that was generated by an observational study of human tutors. This paper presents the observational study, the case-based method, the ATS itself and its implementation on a distributed computer systems for real-time performance, and finally the implications of the findings for Human Computer Interaction in general and e-learning in particular. Web-based applications of the technology developed in this research are discussed throughout the paper.     

Detection and classification of road signs in natural environments

An automatic road sign recognition system first locates road signs within images captured by an imaging sensor on-board of a vehicle, and then identifies the detected road signs. This paper presents an automatic neural-network-based road sign recognition system. First, a study of the existing road sign recognition research is presented. In this study, the issues associated with automatic road sign recognition are described, the existing methods developed to tackle the road sign recognition problem are reviewed, and a comparison of the features of these methods is given. Second, the developed road sign recognition system is described. The system is capable of analysing live colour road scene images, detecting multiple road signs within each image, and classifying the type of road signs detected. The system consists of two modules: detection and classification. The detection module segments the input image in the hue-saturation-intensity colour space, and then detects road signs using a Multi-layer Perceptron neural-network. The classification module determines the type of detected road signs using a series of one to one architectural Multi-layer Perceptron neural networks. Two sets of classifiers are trained using the Resillient-Backpropagation and Scaled-Conjugate-Gradient algorithms. The two modules of the system are evaluated individually first. Then the system is tested as a whole. The experimental results demonstrate that the system is capable of achieving an average recognition hit-rate of 95.96% using the scaled-conjugate-gradient trained classifiers.     

多处理器环境中基于节能及容错的实时动态调度算法

当前处理器由于较高的能量消耗,导致处理器热量散发的提高及系统可靠性的降低,同时任务实际运行中的错误也降低了系统的可靠性.因此同时满足节能性及容错性已经成为目前计算机领域较为关心的问题.提出的调度算法针对实时多处理器计算环境,以执行时间最短的任务优先调度为基础,结合其他有效技术(共享空闲时间回收及检查点技术),使得实时任务在其截止期内完成的同时,能够动态地降低整个系统的能量消耗及动态容错.针对独立任务集及具有依赖关系的任务集,提出两种算法:STFBA1及STFBA2(shortest task first based algorithm).通过实验与目前所知的有效算法相比,算法具有更好的性能(调度长度及能量消耗)及较低的通信时间复杂度.     

Constructions of Low-degree and Error-Correcting ε-Biased Generators

In this work we give two new constructions of ε-biased generators. Our first construction significantly extends a result of Mossel et al. (Random Structures and Algorithms 2006, pages 56-81), and our second construction answers an open question of Dodis and Smith (STOC 2005, pages 654-663). In particular we obtain the following results: